Fast network performance in containerized environments for network function virtualization

ABSTRACT

Aspects of the subject technology relate to methods for inter-container communication in a virtual network environment. Steps for implementing an inter-container communication method can include: creating, using a container management system, a file-structure in a shared memory, generating, by the container management system, a first memory-mapping between the file-structure and a first network container, and generating, by the container management system, a second memory-mapping between the file-structure and a second network container. In some aspects, the method can further include steps for transferring at least one data packet from the first network container to the second network container via the file-structure in the shared memory. Systems and machine-readable media are also provided.

TECHNICAL FIELD

This disclosure relates generally to container-based networking, and in particular, to inter-container communication using memory-mapped files that avoid the need for kernel-calls at each communication cycle.

BACKGROUND

Network Function Virtualization (NFV) technology, in combination with Software Defined Networking (SDN), promises to help transform carrier networks. The utilization of NFV and SDN technologies allows the decoupling of network functions from underlying hardware so that they run as software images or logical modules, for example, on commercial off-the-shelf and/or purpose-built hardware.

One objective of NFV is to reduce the dependence on dedicated physical devices by allocating and using the physical and virtual resources only when and where needed. With this approach, service providers can reduce costs by shifting components to a common physical infrastructure while optimizing its use, allowing them to respond more dynamically to changing market demands by deploying new applications and services as needed. The virtualization of network functions accelerates the time to market for new services by allowing for more automated and streamlined approaches to service delivery.

BRIEF DESCRIPTION OF THE DRAWINGS

In order to describe the manner in which the above-recited and other advantages and features of the disclosure can be obtained, a more particular description of the principles briefly described above will be rendered by reference to specific embodiments thereof which are illustrated in the appended drawings. Understanding that these drawings depict only example aspects of the disclosure and are not therefore to be considered to be limiting of its scope, the principles herein are described and explained with additional specificity and detail through the use of the accompanying drawings in which:

FIG. 1 illustrates a diagram of an example virtual network environment;

FIG. 2A illustrates an example of a containerized network environment, according to some aspects of the technology;

FIG. 2B illustrates an example of a memory-mapping configuration used to facilitate inter-container communication;

FIG. 3 illustrates steps of an exemplary method for facilitating inter-container communication;

FIG. 4 illustrates an example of a network device; and

FIGS. 5A and 5B illustrate example system embodiments.

DESCRIPTION OF EXAMPLE EMBODIMENTS

Various embodiments of the disclosure are discussed in detail below. While specific implementations are discussed, it should be understood that this is done for illustration purposes only. A person of skill the art will recognize that other components and configurations can be used without parting from the spirit and scope of the disclosure.

Overview:

Aspects of the subject technology relate to methods for inter-container communication in a virtual network environment. Steps for implementing an inter-container communication method can include creating (using a container-management system), a shared portion of memory (e.g., a file structure), for example, that includes at least two shareable memory segments, generating a first memory-mapping between the memory segments and each of a first network container and a second network container. In some aspects, the method can further include steps for transferring at least one data packet from the first network container to the second network container via the file-structure in the shared memory.

Description:

FIG. 1 illustrates a diagram of an example virtual network environment 100. Fabric 112 can represent the underlay (i.e., physical network) of network environment 100. Fabric 112 can include spine routers 1-N (102 _(A-N)) (collectively “102”) and leaf routers 1-N (104A_(A-N)) (collectively “104”). Leaf routers 104 can reside at the edge of fabric 112, and can thus represent the physical network edges. Leaf routers 104 can be, for example, top-of-rack (“ToR”) switches, aggregation switches, gateways, ingress and/or egress switches, provider edge devices, and/or any other type of routing or switching device.

Leaf routers 104 can be responsible for routing and/or bridging tenant or endpoint packets and applying network policies. Spine routers 102 can perform switching and routing within fabric 112. Thus, network connectivity in fabric 112 can flow from spine routers 102 to leaf routers 104, and vice versa.

Leaf routers 104 can provide servers 1-4 (106 _(A-D)) (collectively “106”), hypervisors 1-4 (108 _(A)-108 _(D)) (collectively “108”), virtual machines (VMs) 1-4 (110 _(A)-110 _(D)) (collectively “110”), collectors 118, engines 120, and the Layer 2 (L2) network access to fabric 112. For example, leaf routers 104 can encapsulate and decapsulate packets to and from servers 106 in order to enable communications throughout environment 100. Leaf routers 104 can also connect other network-capable device(s) or network(s), such as a firewall, a database, a server, etc., to the fabric 112. Leaf routers 104 can also provide any other servers, resources, endpoints, external networks, VMs, services, tenants, or workloads with access to fabric 112.

VMs 110 can be virtual machines hosted by hypervisors 108 running on servers 106. Hypervisors 108 can provide a layer of software, firmware, and/or hardware that creates and runs the VMs 110. Hypervisors 108 can allow VMs 110 to share hardware resources on servers 106, and the hardware resources on servers 106 to appear as multiple, separate hardware platforms. Moreover, hypervisors 108 and servers 106 can host one or more VMs 110. For example, server 106 _(A) and hypervisor 108 _(A) can share host VMs 110 _(A-B).

VMs 110 can be used to implement various network virtualization functions, such as switching and routing operations, wherein packets are transferred between different VM's. VMs allow for the efficient movement of packets from VM to VM, avoiding context switches. However, because VMs are generally susceptible to VM exits, various operations performed by the VMs are often subject to a CPU penalty. Therefore, a need exists to improve the efficiency of packet communication between processes.

The subject technology addresses some of the limitations incurred by VM-to-VM communication by providing inter-container communication solutions that avoid CPU penalties incurred by vmexits and context switches. Because containers have lower overhead than VMs (e.g., they incur no CPU penalty for uncontained host processes), a more efficient communication process can be achieved using container-to-container packet transfer solutions for the movement of packets that do not frequently require context switches.

Aspects of the subject technology make use of shared memory allocations (e.g., shared files or shared memory segments) that can be jointly accessed by two or more independent containers for the purpose of swapping packets. As discussed in further detail below, the shared file/s can be logically partitioned and memory mapped into the respective containers. By restricting read/write operations for different logical partitions of the shared file, access collisions between containers can be avoided.

In some approaches, a container management system can be used to create a shared file in a memory-backed filesystem, where the shared file is container-independent, i.e. it resides outside of the communicating containers. The shared file can then be memory-mapped into each communicating container (e.g., a first container and a second container), such that read/write access to different portions of the shared file do not overlap as-between containers. For example, only one container may be given write access for a particular memory segment (or queue), so that access collisions are avoided. As such, in contrast to conventional (isolated) container allocated memory, the shared file can be accessed by both containers Joint access to the shared file allows container isolation to be maintained, aside from the communication channel provided via the shared file.

FIG. 2A illustrates an example of containerized network environment 200 that can be implemented on Server 1 106 _(A) (see FIG. 1). As illustrated, container environment 200 includes operating system 202, container management system 204, and multiple containers (e.g., Container A and Container B). Container environment 200 also includes shared container space 206, which facilitates packet transfer between Container A and Container B.

In practice, shared container space 206 is created by container management system 204, and memory-mapped into both Container A and Container B. As discussed in further detail with respect to FIG. 2B, the memory-mapping can be performed such that read and write access to the same portions of shared container space 206 do no overlap, therefore avoiding the possibility of access collisions.

FIG. 2B illustrates an example of a memory-mapping configuration used to facilitate inter-container communication, according to some aspects of the technology. In particular, shared container space 206 is logically partitioned into two packet queues, e.g., Queue 1 and Queue 2, with each logical partition assigned to a different memory access mapping with respect to Container A and Container B. In the illustrated example, Container A is memory-mapped to shared container space 206, having write access to Queue 1, and read access from Queue 2. Conversely, Container B is memory-mapped to shared container space 206, having write access to Queue 2, and read access from Queue 2.

In practice, this memory-mapping configuration enables packets to be passed from Container A (when packets are written by Container A to Queue 1), to Container B (when packets are read by Container B from Queue 1). Similarly, packets can be passed from Container B (when packets are written Container B to Queue 2), to Container A (when packets are read by Container A from Queue 2).

Although packet queues are one type of data structure that can be implemented on shared container space 206, it is understood that any of a variety of packet queues or other data structures can be implemented, without departing from the scope of the technology. Additionally, multiple shared files or memory structures may be implemented, depending on the desired implementation.

In some aspects, wherein interrupt-driven operation is desired, various systems (such as a pipe), can be placed in a shared file system (e.g., shared container space 206), and used to exchange asynchronous messages. For example, asynchronous message exchange can be used to provide messages regarding one or more packet queues, such as: indications that a queue contains packets, indications that a queue has received additional packets, indications that packets in a queue have been consumed, and/or indications of a queue fill state (e.g., full or empty), etc.

In implementations wherein a polling operation is required, (e.g., in fast network-focused applications), the receiving (reading) process can tight loop on the shared memory, for example, to identify if new packets have been received. Similarly, the writing process can tight-loop on the shared memory to see if further buffers have been freed, for example, such that additional packets can be forwarded.

FIG. 3 illustrates steps of an example method 300 for facilitating inter-container communication. Method 300 begins with step 302, in which a shared memory portion (e.g., a shared file segment or file structure) is allocated, e.g., by a container management system, such as container management system 204, discussed above. The file segment (or file structure) can include one or more files and/or one or more data structures, such as one or more packet queues. Additionally, as discussed above, file structure can be partitioned into two or more logical segments, for example, where each individual segment is associated with alternating read/write permissions for different containers.

In step 304, a first memory-mapping is generated between the file structure and the first network container. The memory-mapping permits container access to the file structure, which reside outside the container. In some implementations, the memory-mapping specifies what types of this operations (e.g., read or write) may be performed with respect to the file structure. In some aspects, read access is granted to one container, whereas read-and-write access is granted to the other, such that one container has the exclusive ability to write, thereby avoiding potential memory-access collisions.

Further to the example provided above with respect to FIG. 2B, a first container (e.g., Container A) can be memory mapped to logical partitions (e.g. Queue 1 and Queue 2) of the file structure, such that the first container is permitted to perform write operations with respect to Queue 1, and read operations with respect to Queue 2.

In step 306, a second memory-mapping is created between the file structure and the second network container. The second memory-mapping permits file structure access by the second container, e.g., Container B, in the above example. In this manner, the second container is permitted to perform read and write operations on different logical portions of the file structure. That is, the second container can be permitted to perform write operations into Queue 2, and read operations from Queue 1. As discussed above, by alternating the read/write operations that are permitted by each container on a particular portion of the shared container space, access collisions can be avoided while enabling inter-container communication be performed.

In step 308, at least one data packet is transferred from the first network container to the second network container via the file structure in the shared memory. Specifically, packet transfer can be accomplished between the first network container (e.g., Container A), and the second network container (e.g., Container B), by first storing (writing) the packet to Queue 1 of the file structure. Subsequently, Container B retrieves the start packet by performing a read operation with respect to Queue 1. As such, inter-container communication can be accomplished via a communication channel created by the shared container space, while still retaining container isolation.

Those of skill in the art will readily appreciate that the inter-container communication method 300 aligns well with favored modes of VM operation, for example, whereby control of a network interface provided to the VM is removed from the kernel and handed directly to the process delivering the network function. Thus, unlike the VM model, inter-container communication methods do not attempt to deliver an interface that can be used either by the kernel or by a process.

Additionally, it is understood that aspects of the inter-container process described herein can be analogized to, and implemented at, the process level, e.g., to facilitate communication on a process-to-process basis. That is, shared memory techniques disclosed above can be used to provide direct communication channels between independent and otherwise isolated processes, without the need for kernel involvement.

FIG. 4 illustrates an example network device 410 according to some embodiments. Network device 410 includes a master central processing unit (CPU) 462, interfaces 468, and bus 415 (e.g., a PCI bus). When acting under the control of appropriate software and/or firmware, CPU 462 is responsible for executing packet management, error detection, and/or routing functions. CPU 462 preferably accomplishes all these functions under the control of software including an operating system and any appropriate applications software. CPU 462 can include one or more processors 463 such as a processor from the Motorola family of microprocessors or the MIPS family of microprocessors. In an alternative embodiment, processor 463 is specially designed hardware for controlling the operations of router 410. In a specific embodiment, a memory 461 (such as non-volatile RAM and/or ROM) also forms part of CPU 462. However, there are many different ways in which memory could be coupled to the system.

Interfaces 468 can be provided as interface cards (sometimes referred to as “line cards”). Generally, they control the sending and receiving of data packets over the network and sometimes support other peripherals used with the router 410. Among the interfaces that can be provided are Ethernet interfaces, frame relay interfaces, cable interfaces, DSL interfaces, token ring interfaces, and the like. In addition, various very high-speed interfaces can be provided such as fast token ring interfaces, wireless interfaces, Ethernet interfaces, Gigabit Ethernet interfaces, ATM interfaces, HSSI interfaces, POS interfaces, FDDI interfaces and the like. Generally, these interfaces may include ports appropriate for communication with the appropriate media. In some cases, they may also include an independent processor and, in some instances, volatile RAM. The independent processors may control such communications intensive tasks as packet switching, media control and management. By providing separate processors for the communications intensive tasks, these interfaces allow the master microprocessor 462 to efficiently perform routing computations, network diagnostics, security functions, etc.

Although the system shown in FIG. 4 is one specific network device of the present invention, it is by no means the only network device architecture on which the present invention can be implemented. For example, an architecture having a single processor that handles communications as well as routing computations, etc. is often used. Further, other types of interfaces and media could also be used with the router.

Regardless of the network device's configuration, it may employ one or more memories or memory modules (including memory 461) configured to store program instructions for the general-purpose network operations and mechanisms for roaming, route optimization and routing functions described herein. The program instructions may control the operation of an operating system and/or one or more applications, for example. The memory or memories may also be configured to store tables such as mobility binding, registration, and association tables, etc.

FIG. 5A and FIG. 5B illustrate example system embodiments. The more appropriate embodiment will be apparent to those of skill in the art when practicing the present technology. Persons of ordinary skill in the art will also readily appreciate that other system embodiments are possible.

FIG. 5A illustrates a system bus computing system architecture 500 wherein the components of the system are in electrical communication with each other using a bus 505. Exemplary system 500 includes a processing unit (CPU or processor) 510 and a system bus 505 that couples various system components including the system memory 515, such as read only memory (ROM) 520 and random access memory (RAM) 525, to the processor 510. The system 500 can include a cache of high-speed memory connected directly with, in close proximity to, or integrated as part of the processor 510. The system 500 can copy data from the memory 515 and/or the storage device 530 to the cache 512 for quick access by the processor 510. In this way, the cache can provide a performance boost that avoids processor 510 delays while waiting for data. These and other modules can control or be configured to control the processor 510 to perform various actions. Other system memory 515 can be available for use as well.

Memory 515 can include multiple different types of memory with different performance characteristics. The processor 510 can include any general purpose processor and a hardware module or software module, such as module 1 532, module 2 534, and module 3 536 stored in storage device 530, configured to control the processor 510 as well as a special-purpose processor where software instructions are incorporated into the actual processor design. The processor 510 may essentially be a completely self-contained computing system, containing multiple cores or processors, a bus, memory controller, cache, etc. A multi-core processor can be symmetric or asymmetric.

To enable user interaction with the computing device 500, an input device 545 can represent any number of input mechanisms, such as a microphone for speech, a touch-sensitive screen for gesture or graphical input, keyboard, mouse, motion input, speech and so forth. An output device 535 can also be one or more of a number of output mechanisms known to those of skill in the art. In some instances, multimodal systems can enable a user to provide multiple types of input to communicate with the computing device 500. The communications interface 540 can generally govern and manage the user input and system output. There is no restriction on operating on any particular hardware arrangement and therefore the basic features here may easily be substituted for improved hardware or firmware arrangements as they are developed.

Storage device 530 is a non-volatile memory and can be a hard disk or other types of computer readable media which can store data that are accessible by a computer, such as magnetic cassettes, flash memory cards, solid state memory devices, digital versatile disks, cartridges, random access memories (RAMs) 525, read only memory (ROM) 520, and hybrids thereof.

The storage device 530 can include software modules 532, 534, 536 for controlling the processor 510. Other hardware or software modules are contemplated. The storage device 530 can be connected to the system bus 505. In one aspect, a hardware module that performs a particular function can include the software component stored in a computer-readable medium in connection with the necessary hardware components, such as the processor 510, bus 505, display 535, and so forth, to carry out the function.

FIG. 5B illustrates an example computer system 550 having a chipset architecture that can be used in executing the described method and generating and displaying a graphical user interface (GUI). Computer system 550 is an example of computer hardware, software, and firmware that can be used to implement the disclosed technology. System 550 can include a processor 555, representative of any number of physically and/or logically distinct resources capable of executing software, firmware, and hardware configured to perform identified computations. Processor 555 can communicate with a chipset 560 that can control input to and output from processor 555. In this example, chipset 560 outputs information to output device 565, such as a display, and can read and write information to storage device 570, which can include magnetic media, and solid state media, for example. Chipset 560 can also read data from and write data to RAM 575. A bridge 580 for interfacing with a variety of user interface components 585 can be provided for interfacing with chipset 560. Such user interface components 585 can include a keyboard, a microphone, touch detection and processing circuitry, a pointing device, such as a mouse, and so on. In general, inputs to system 550 can come from any of a variety of sources, machine generated and/or human generated.

Chipset 560 can also interface with one or more communication interfaces 590 that can have different physical interfaces. Such communication interfaces can include interfaces for wired and wireless local area networks, for broadband wireless networks, as well as personal area networks. Some applications of the methods for generating, displaying, and using the GUI disclosed herein can include receiving ordered datasets over the physical interface or be generated by the machine itself by processor 555 analyzing data stored in storage 570 or 575. Further, the machine can receive inputs from a user via user interface components 585 and execute appropriate functions, such as browsing functions by interpreting these inputs using processor 555.

It can be appreciated that example systems 500 and 550 can have more than one processor 510 or be part of a group or cluster of computing devices networked together to provide greater processing capability.

For clarity of explanation, in some instances the present technology may be presented as including individual functional blocks including functional blocks comprising devices, device components, steps or routines in a method embodied in software, or combinations of hardware and software.

In some embodiments the computer-readable storage devices, mediums, and memories can include a cable or wireless signal containing a bit stream and the like. However, when mentioned, non-transitory computer-readable storage media expressly exclude media such as energy, carrier signals, electromagnetic waves, and signals per se.

Methods according to the above-described examples can be implemented using computer-executable instructions that are stored or otherwise available from computer readable media. Such instructions can comprise, for example, instructions and data which cause or otherwise configure a general purpose computer, special purpose computer, or special purpose processing device to perform a certain function or group of functions. Portions of computer resources used can be accessible over a network. The computer executable instructions may be, for example, binaries, intermediate format instructions such as assembly language, firmware, or source code. Examples of computer-readable media that may be used to store instructions, information used, and/or information created during methods according to described examples include magnetic or optical disks, flash memory, USB devices provided with non-volatile memory, networked storage devices, and so on.

Devices implementing methods according to these disclosures can comprise hardware, firmware and/or software, and can take any of a variety of form factors. Typical examples of such form factors include laptops, smart phones, small form factor personal computers, personal digital assistants, rackmount devices, standalone devices, and so on. Functionality described herein also can be embodied in peripherals or add-in cards. Such functionality can also be implemented on a circuit board among different chips or different processes executing in a single device, by way of further example.

The instructions, media for conveying such instructions, computing resources for executing them, and other structures for supporting such computing resources are means for providing the functions described in these disclosures.

Although a variety of examples and other information was used to explain aspects within the scope of the appended claims, no limitation of the claims should be implied based on particular features or arrangements in such examples, as one of ordinary skill would be able to use these examples to derive a wide variety of implementations. Further and although some subject matter may have been described in language specific to examples of structural features and/or method steps, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to these described features or acts. For example, such functionality can be distributed differently or performed in components other than those identified herein. Rather, the described features and steps are disclosed as examples of components of systems and methods within the scope of the appended claims. Moreover, claim language reciting “at least one of” a set indicates that one member of the set or multiple members of the set satisfy the claim.

It should be understood that features or configurations herein with reference to one embodiment or example can be implemented in, or combined with, other embodiments or examples herein. That is, terms such as “embodiment”, “variation”, “aspect”, “example”, “configuration”, “implementation”, “case”, and any other terms which may connote an embodiment, as used herein to describe specific features or configurations, are not intended to limit any of the associated features or configurations to a specific or separate embodiment or embodiments, and should not be interpreted to suggest that such features or configurations cannot be combined with features or configurations described with reference to other embodiments, variations, aspects, examples, configurations, implementations, cases, and so forth. In other words, features described herein with reference to a specific example (e.g., embodiment, variation, aspect, configuration, implementation, case, etc.) can be combined with features described with reference to another example. Precisely, one of ordinary skill in the art will readily recognize that the various embodiments or examples described herein, and their associated features, can be combined with each other.

A phrase such as an “aspect” does not imply that such aspect is essential to the subject technology or that such aspect applies to all configurations of the subject technology. A disclosure relating to an aspect may apply to all configurations, or one or more configurations. A phrase such as an aspect may refer to one or more aspects and vice versa. A phrase such as a “configuration” does not imply that such configuration is essential to the subject technology or that such configuration applies to all configurations of the subject technology. A disclosure relating to a configuration may apply to all configurations, or one or more configurations. A phrase such as a configuration may refer to one or more configurations and vice versa. The word “exemplary” is used herein to mean “serving as an example or illustration.” Any aspect or design described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other aspects or designs. 

What is claimed is:
 1. A method comprising: creating, using a container management system, a file-structure in a shared memory, the shared memory logically partitioned into at least two logical portions, the at least two logical portions including a first packet queue and a second packet queue, the shared memory shared between a first network container and a second network container; generating, by the container management system, a first memory-mapping, between the file-structure and the first network container, to permit transfer of first network container data packets from the first network container to the file-structure; generating, by the container management system, a second memory mapping, between the file-structure and the second network container, to permit transfer of second network container data packets from the second network container to the file-structure, the second memory-mapping generated without any overlapping read/write access between the first network container, the second network container, and the file-structure; and polling the shared memory via a tight-loop read/write process, wherein the tight-loop read/write process is used for identifying free buffers and forwarding additional packets.
 2. The method of claim 1, further comprising: transferring at least one data packet of the first network container data packets from the first network container to the second network container via the file-structure in the shared memory.
 3. The method of claim 2, wherein transferring the at least one data packet from the first network container to the second network container is performed independently of a kernel process.
 4. The method of claim 1, wherein the first mapping is configured to permit the first network container to perform a memory-write operation on a first logical portion of the file-structure, and a memory-read operation on a second logical portion of the file-structure.
 5. The method of claim 4, wherein the second mapping is configured to permit the second network container to perform another memory-write operation on the second logical portion of the file-structure, and another memory-read operation on the first logical portion of the file-structure.
 6. The method of claim 1, wherein, the first network container is configured with write access to the first packet queue, the first network container is configured with read access to the second packet queue, the second network container is configured with write access to the second packet queue, and the second network container is configured with read access to the first packet queue.
 7. The method of claim 1, wherein each of the first network container and the second network container is associated with alternating read/write permissions for different ones of the first packet queue and the second packet queue.
 8. The method of claim 1, further comprising: exchanging messages asynchronously regarding at least one of the first packet queue or the second packet queue.
 9. A system comprising: one or more hardware processors; and a computer-readable medium storing instructions, which when executed by the one or more hardware processors, cause the one or more hardware processors to perform operations comprising: creating a file-structure in a shared memory, the shared memory logically partitioned into at least two logical portions, the at least two logical portions including a first packet queue and a second packet queue, the shared memory shared between a first network container and a second network container: generating a first memory-mapping, between the file-structure and the first network container, to permit transfer of first network container data packets from the first network container to the file-structure; generating a second memory-mapping, between the file-structure and the second network container, to permit transfer of second network container data packets from the second network container to the file-structure, the second memory-mapping generated without any overlapping read/write access between the first network container, the second network container, and the file-structure; and polling the shared memory via a tight-loop read/write process, wherein the tight-loop read/write process is used for identifying free buffers and forwarding additional packets.
 10. The system of claim 9, wherein the instructions are further configured to cause the one or more hardware processors to perform operations comprising: transferring at least one data packet of the first network container data packets from the first network container to the second network container via the file-structure in the shared memory.
 11. The system of claim 10, wherein transferring the at least one data packet from the first network container to the second network container is performed independently of a kernel process.
 12. The system of claim 9, wherein the first mapping is configured to permit the first network container to perform a memory-write operation on a first logical portion of the file-structure, and a memory-read operation on a second logical portion of the file-structure.
 13. The system of claim 12, wherein the second mapping is configured to permit the second network container to perform another memory-write operation on the second logical portion of the file-structure, and another memory-read operation on the first logical portion of the file-structure.
 14. The system of claim 9, wherein the file-structure in the shared memory is a memory-mapped file system.
 15. A non-transitory computer-readable storage medium comprising instructions stored therein, which when executed by one or more processors, cause the processors to perform operations comprising: creating, using a container management system, a file-structure in a shared memory, the shared memory logically partitioned into at least two logical portions, the at least two logical portions including a first packet queue and a second packet queue, the shared memory shared between a first network container and a second network container; generating, by the container management system, a first memory-mapping, between the file-structure and the first network container, to permit transfer of first network container data packets from the first network container to the file-structure; generating, by the container management system, a second memory-mapping, between the file-structure and the: second network container, to permit transfer second network container data packets from the second network container to the file-structure, the second memory-mapping generated without any overlapping read/write access between the first network container, the second network container, and the file-structure; and polling the shared memory via a tight-loop read/write process, wherein the tight-loop read/write process is used for identifying free buffers and forwarding additional packets.
 16. The non-transitory computer-readable storage medium of claim 15, wherein the processors are further configured to perform operations comprising: transferring at least one data packet of the first network container data packets from the first network container to the second network container via the file-structure in the shared memory.
 17. The non-transitory computer-readable storage medium of claim 16, wherein transferring the at least one data packet from the first network container to the second network container is performed independently of a kernel process.
 18. The non-transitory computer-readable storage medium of claim 15, wherein the first mapping is configured to permit the first network container to perform a memory-write operation on a first logical portion of the file-structure, and a memory-read operation on a second logical portion of the file-structure.
 19. The non-transitory computer-readable storage medium of claim 18, wherein the second mapping is configured to permit the second network container to perform another memory-write operation on the second logical portion of the file-structure, and another memory-read operation on the first logical portion of the file-structure. 